Optimal Chunk Caching in Network Coding Based Qualitative Communication
نویسندگان
چکیده
منابع مشابه
A chunk-based caching algorithm for streaming video
It is customary nowadays that large web objects are cached somewhere close to the user. This saves traffic upstream of the cache and offers the users a better responsiveness. Caching algorithms typically rank the objects in some way and cache the top-ranked objects. In this paper we study a scenario in which a requested video is (instantaneously) streamed to the user and in which the video libr...
متن کاملOptimal caching placement for wireless femto-caching network
This paper investigates optimal caching placement for wireless femto-caching network. The average bit error rate (BER) is formulated as a function of caching placement under wireless fading. To minimize the average BER, we propose a greedy algorithm finding optimal caching placement with low computational complexity. Exploiting the property of the optimal caching placement which we derive, the ...
متن کاملOrder Optimal Coded Delivery and Caching: Multiple Groupcast Index Coding
The capacity of caching networks has received considerable attention in the past few years. A particularly studied setting is the case of a single server (e.g., a base station) and multiple users, each of which caches segments of files in a finite library. Each user requests one (whole) file in the library and the server sends a common coded multicast message to satisfy all users at once. The p...
متن کاملCooperative Communication Using Network Coding
We consider a cognitive radio network scenario where a primary transmitter and a secondary transmitter, respectively, communicate a message to their respective primary receiver and secondary receiver over a packet-based wireless link, using a joint automatic-repeat-request (ARQ) error control scheme. The secondary transmitter assists in the retransmission of the primary message, which improves ...
متن کاملTowards Optimal Deterministic Coding for Interactive Communication
We show an efficient, deterministic interactive coding scheme that simulates any interactive protocol under random errors with nearly optimal parameters. Specifically, our main result gives an efficient deterministic interactive coding scheme that achieves a communication rate of 1 − O( √ H( )) and a failure probability of exp(−n/ log n), where n is the protocol length and each bit is flipped i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Digital Communications and Networks
سال: 2021
ISSN: 2352-8648
DOI: 10.1016/j.dcan.2021.06.002